Iterative Decoding of Product Code
نویسندگان
چکیده
Product codes based on binary block codes are considered. The aim is to use simple block codes as component codes in the constructions. Then, by using interleaving, large codes can be obtained. The fundamental aim of the interleaving is to obtain codes with a structure that is suitable for iterative decoding. We present interleaving strategies for iterative (turbo) decoding of block codes. A simple interleaving rule is devised. It is suitable in many practical constructions and it is based on combinatorial conngurations. We also present simulation results of the achievable performance with iterative decoding of our code constructions.
منابع مشابه
Comdined Turbo Block Decoding and Equalisation
In this paper, the combination of equalization and turbo decoding is studied. In the iterative decoding of a product code in block turbo coding system, the equalization process is performed within the iteration loop. The present study aims to investigate the decision feedback equalizer (DFE) incorporated in the iterative decoding. Simulation results show that the more severe the channel interfe...
متن کاملComdined Turbo Block Decoding and Equalisation
In this paper, the combination of equalization and turbo decoding is studied. In the iterative decoding of a product code in block turbo coding system, the equalization process is performed within the iteration loop. The present study aims to investigate the decision feedback equalizer (DFE) incorporated in the iterative decoding. Simulation results show that the more severe the channel interfe...
متن کاملIterative Decoding Performance of Geometric Augmented Product Codes over Awgn Channel
We present iterative decoding process of Geometric Augmented Product codes that is a newly proposed linear block code construction technique. We also report the bit error performances for one of the constructed code of the technique utilising our iterative decoding approach.
متن کاملGraph-based iterative decoding algorithms for parity-concatenated trellis codes
In this paper, we construct parity-concatenated trellis codes in which a trellis code is used as the inner code and a simple parity-check code is used as the outer code. From the Tanner–Wiberg–Loeliger (TWL) graph representation, several iterative decoding algorithms can be derived. However, since the graph of the parity-concatenated code contains many short cycles, the conventional min-sum and...
متن کاملIterative Least-Squares Decoding of Analog Product Codes
We define analog product codes as a special case of analog parallel concatenated codes. These codes serve as a tool to get some more insight into the convergence of “Turbo” decoding. We prove that the iterative “Turbo”-like decoding of analog product codes indeed is an estimation in the least-squares sense and thus correspond to the optimum maximum-likelihood decoding.
متن کامل